Two segment classes with Hamiltonian visibility graphs
نویسندگان
چکیده
منابع مشابه
Segment endpoint visibility graphs are hamiltonian
We show that the segment endpoint visibility graph of any finite set of disjoint line segments in the plane admits a simple Hamiltonian polygon, if not all segments are collinear. This proves a conjecture of Mirzaian.
متن کاملTwo New Classes of Hamiltonian Graphs
We prove that a triangular grid without local cuts is (almost) always Hamiltonian. This suggests an efficient scheme for rendering triangulated manifolds by graphics hardware. We also show that the Hamiltonian Cycle problem is NP-Complete for planar subcubic graphs of arbitrarily high girth. As a by-product we prove that there exist tri-Hamiltonian planar subcubic graphs of arbitrarily high gir...
متن کاملPlanar segment visibility graphs
Given a set of n disjoint line segments in the plane, the segment visibility graph is the graph whose 2n vertices correspond to the endpoints of the line segments and whose edges connect every pair of vertices whose corresponding endpoints can see each other. In this paper we characterize and provide a polynomial time recognition algorithm for planar segment visibility graphs. Actually, we char...
متن کاملHamiltonian Paths in Two Classes of Grid Graphs
In this paper, we give the necessary and sufficient conditions for the existence of Hamiltonian paths in L−alphabet and C−alphabet grid graphs. We also present a linear-time algorithm for finding Hamiltonian paths in these graphs.
متن کاملHamiltonian Paths in Some Classes of Grid Graphs
The Hamiltonian path problem for general grid graphs is known to be NP-complete. In this paper, we give necessary and sufficient conditions for the existence of Hamiltonian paths in L-alphabet, C-alphabet, F-alphabet, and E-alphabet grid graphs. We also present linear-time algorithms for finding Hamiltonian paths in these graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1994
ISSN: 0925-7721
DOI: 10.1016/0925-7721(94)90019-1